Limit points for average genus II. 2-Connected non-simplicial graphs
نویسندگان
چکیده
In part (I) of this paper, it is proved that there are no limit points for the set of values of average genus of 2-connected simplicial graphs and of 3-connected graphs. The need for such restrictions is now demonstrated by showing that innnitely many real numbers are limit points of values of average genus for 2-connected non-simplicial graphs. A systematic method for constructing such limit points is presented, and it is proved that this method is essentially the only way to construct limit points of values of average genus for \homeomorphically nested" 2-connected graphs.
منابع مشابه
Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs
It is demonstrated that a given value of average genus is shared by at most nitely many 2-connected simplicial graphs and by at most nitely many 3-connected graphs. Moreover, the distribution of values of average genus is sparse, in the following sense: within any nite real interval, there are at most nitely many different numbers that are values of average genus for 2-connected simplicial grap...
متن کاملOn the limit points of the smallest eigenvalues of regular graphs
In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [−1− √ 2,−2) and also infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [α1,−1− √ 2) where α1 is the smallest root(≈ −2.4812) of the polynomial x3 + 2x2 − 2x − 2. From these results, we ...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملOn the average genus of a graph
Not all rational numbers are possibilities for the average genus of an individual graph. The smallest such numbers are determined. and varied examples are constructed to demonstrate that a single value of average genus can be shared by arbitrarily many different graphs. It is proved that the number one is a limit point of the set of possible values for average genus and that the complete graph ...
متن کاملOn the topology of simplicial complexes related to 3-connected and Hamiltonian graphs
Using techniques from Robin Forman’s discrete Morse theory, we obtain information about the homology and homotopy type of some graph complexes. Specifically, we prove that the simplicial complex ∆n of not 3-connected graphs on n vertices is homotopy equivalent to a wedge of (n − 3) · (n − 2)!/2 spheres of dimension 2n − 4, thereby verifying a conjecture by Babson, Björner, Linusson, Shareshian,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 56 شماره
صفحات -
تاریخ انتشار 1992